| 翻訳と辞書 |
| ATS (programming language) ： ウィキペディア英語版 |
ATS (programming language)
ATS (Applied Type System) is a programming language designed to unify programming with formal specification. There is support in ATS for combining theorem proving with practical programming through the use of advanced type systems.〔(Combining Programming with Theorem Proving )〕 The performance of ATS has been demonstrated to be comparable to that of the C and C++ programming languages.〔(ATS benchmarks | Computer Language Benchmarks Game ) (web archive)〕 By using theorem proving and strict type checking, the compiler can detect and prove that its implemented functions are not susceptible to bugs such as division by zero, memory leaks, buffer overflow, and other forms of memory corruption by verifying pointer arithmetic and reference counting before the program compiles. Additionally, by using the integrated theorem-proving system of ATS (ATS/LF), the programmer may make use of static constructs that are intertwined with the operative code to prove that a function attains its specification.
== History ==
ATS is derived mostly from the ML and OCaml programming languages. An earlier language, Dependent ML, by the same author has been incorporated by the language.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「ATS (programming language)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|